Update TCP_common.c - #2387
Conversation
func: add_priority priority_queue_start is a list for read, priority_queue_start is just as a tag
41d1dc2 to
79d1bbf
Compare
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #2387 +/- ##
==========================================
+ Coverage 9.98% 10.00% +0.02%
==========================================
Files 141 141
Lines 32530 32530
==========================================
+ Hits 3247 3255 +8
+ Misses 29283 29275 -8 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
|
Can you explain a bit more what this change is doing? |
it is only a logical problem. priority_queue_start is used to read. |
|
@xzhdream How does this change current behaviour? As far as any of us are aware, this function already works as intended. Are we mistaken? |
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
|
This PR is closed for being an invalid and dangerous change. If you have other ideas, please reopen and discuss. |
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
This test ensures that multiple priority packets added to a `TCP_Connection` while the socket is busy are correctly queued in the linked list without dropping intermediate packets. Specifically, it protects against regressions where updating the tail pointer incorrectly (e.g., using the head pointer as a base for append) would result in data loss. This was identified as a risk in PR TokTok#2387.
func: add_priority
priority_queue_start is a list for read, priority_queue_end is just as a tag
This change is